Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("Mundici, Daniele")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 44

  • Page / 2
Export

Selection :

  • and

Simple Bratteli diagrams with a Gödel-incomplete C*-equivalence problemMUNDICI, Daniele.Transactions of the American Mathematical Society. 2004, Vol 356, Num 5, pp 1937-1955, issn 0002-9947, 19 p.Article

Bookmaking over infinite-valued eventsMUNDICI, Daniele.International journal of approximate reasoning. 2006, Vol 43, Num 3, pp 223-240, issn 0888-613X, 18 p.Article

Many-valued points and equality = Les points multivalués et l'égalitéDROSSOS, Costas; MUNDICI, Daniele.Synthese (Dordrecht). 2000, Vol 125, Num 1-2, pp 97-101, issn 0039-7857Article

Interval MV-algebras and generalizationsCABRER, Leonardo Manuel; MUNDICI, Daniele.International journal of approximate reasoning. 2014, Vol 55, Num 8, pp 1623-1642, issn 0888-613X, 20 p.Article

De Finetti theorem and Borel states in [0, 1]-valued algebraic logicKÜHR, Jan; MUNDICI, Daniele.International journal of approximate reasoning. 2007, Vol 46, Num 3, pp 605-616, issn 0888-613X, 12 p.Article

Computational logic and proof theory (Vienna, August 25-29, 1997)Gottlob, Georg; Leitsch, Alexander; Mundici, Daniele et al.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63385-5, VIII, 348 p, isbn 3-540-63385-5Conference Proceedings

Sketch-as-proofPREINING, N.Lecture notes in computer science. 1997, pp 264-277, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Upper bounds for standardizations and an applicationXI, H.Lecture notes in computer science. 1997, pp 335-348, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Explaining Gentzen's consistency proof within infinitary proof theoryBUCHHOLZ, W.Lecture notes in computer science. 1997, pp 4-17, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Comparing computational representations of Herbrand modelsMATZINGER, R.Lecture notes in computer science. 1997, pp 203-218, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Propositional quantification in intuitionistic logicPOŁACIK, T.Lecture notes in computer science. 1997, pp 255-263, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Translating set theoretical proofs into Type theoretical programsSETZER, A.Lecture notes in computer science. 1997, pp 278-289, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Resolution, inverse method and the sequent calculusTAMMET, T.Lecture notes in computer science. 1997, pp 65-83, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Subtyping over a latticeTIURYN, J.Lecture notes in computer science. 1997, pp 84-88, issn 0302-9743, isbn 3-540-63385-5Conference Paper

The undecidability of simultaneous rigid E-unification with two variablesVEANES, M.Lecture notes in computer science. 1997, pp 305-318, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Paramodulation, superposition, and simplificationBACHMAIR, L.Lecture notes in computer science. 1997, pp 1-3, issn 0302-9743, isbn 3-540-63385-5Conference Paper

On the completeness and decidability of a restricted first order linear temporal logicPLIUSKEVICIUS, R.Lecture notes in computer science. 1997, pp 241-254, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Two semantics and logics based on the Gödel interpretationPLISKO, V.Lecture notes in computer science. 1997, pp 233-240, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Recognition problems and communication complexityWIENER, Gabor.Discrete applied mathematics. 2004, Vol 137, Num 1, pp 109-123, issn 0166-218X, 15 p.Conference Paper

Lattice-ordered Abelian groups and schauder bases of unimodular fansMANARA, Corrado; MARRA, Vincenzo; MUNDICI, Daniele et al.Transactions of the American Mathematical Society. 2007, Vol 359, Num 4, pp 1593-1604, issn 0002-9947, 12 p.Article

Approximate location of relevant variables under the crossover distributionDAMASCHKE, Peter.Discrete applied mathematics. 2004, Vol 137, Num 1, pp 47-67, issn 0166-218X, 21 p.Conference Paper

Variants of the majority problemAIGNER, Martin.Discrete applied mathematics. 2004, Vol 137, Num 1, pp 3-25, issn 0166-218X, 23 p.Conference Paper

1st International Workshop on Combinatorics of Searching, Sorting, and Coding (COSSAC '01), September 7-9, 2001, Ischia, ItalyCICALESE, Ferdinando; MUNDICI, Daniele; VACCARO, Ugo et al.Discrete applied mathematics. 2004, Vol 137, Num 1, issn 0166-218X, 124 p.Conference Proceedings

The tangibility reflection principle for self-verifying axiom systemsWILLARD, D. E.Lecture notes in computer science. 1997, pp 319-334, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Parameter free induction and reflectionBEKLEMISHEV, L. D.Lecture notes in computer science. 1997, pp 103-113, issn 0302-9743, isbn 3-540-63385-5Conference Paper

  • Page / 2